A Genetic Algorithm - Theoretic Approach to Polygonal Approximaton
نویسندگان
چکیده
A method for the polygonal approximation using genetic algorithm is presented here. An approximate polygon has been obtained by choosing a certain number of points from a set of sampled points of the original closed planar curve. The Proposed algorithm searches for the longest possible line by maximizing the objective function involving the length and the integral square error along the line segment. The performance of proposed algorithm have been compared with other strategies reported in the literature.
منابع مشابه
Feature Selection Using Multi Objective Genetic Algorithm with Support Vector Machine
Different approaches have been proposed for feature selection to obtain suitable features subset among all features. These methods search feature space for feature subsets which satisfies some criteria or optimizes several objective functions. The objective functions are divided into two main groups: filter and wrapper methods. In filter methods, features subsets are selected due to some measu...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملOn Improved Deformable Template Matching For Polygonal Objects
In this paper, an improvement of deformable template matching algorithm for polygonal objects in grayscale images using two-dimensional deformable templates along orthogonal curves is presented. In the process of pre-computing extensions of the deformable template along orthogonal curves, the novel matching approach incorporates adapting knowledge-specific template discretization techniques app...
متن کاملConsidering chain to chain competition in forward and reverse logistics of a dynamic and integrated supply chain network design problem
In this paper, a bi-objective model is presented for dynamic and integrated network design of a new entrant competitive closed-loop supply chain. To consider dynamism and integration in the network design problem, multiple long-term periods are regarded during planning horizon, so that each long-term period includes several short-term periods. Furthermore, a chain to chain competition between t...
متن کاملAn Optimized PID for Capsubots using Modified Chaotic Genetic Algorithm (RESEARCH NOTE)
This paper proposes a design for a mesoscale capsule robot which can be used in gaining diagnostic data and delivering medical treatment in inaccessible parts of the human body. A novel approach is presented for the capsule robot control: A PID-controlled closed-loop approach. A modified chaotic genetic algorithm will be used to optimize the coefficients of PID controller. Then, simulation will...
متن کامل